#include<iostream>
#include<Windows.h>
#include<cstdlib>
using namespace std;
const int N = 1000;
long long b[N][N], col[N];
long long sum[N];
int main() {
	for (int i = 0; i < N; i++) {
		unsigned seed;
		seed = time(0);
		srand(seed);
		for (int j = 0; j < N; j++) {
			b[i][j] = rand() % 100;
		}
	}
	for (int i = 0; i < N; i++) {
		col[i] = rand() % 100;
	}
	LARGE_INTEGER t1, t2, tc;
	QueryPerformanceFrequency(&tc);
	QueryPerformanceCounter(&t1);
	for (int k = 0; k < 1000; k++) {
		/*for (int i = 0; i < N; i++) {
			sum[i] = 0.0;
			for (int j = 0; j < N; j++) {
				sum[i] += b[j][i] * col[j];
			}
		}*/
		for (int i = 0; i < N; i++)
		{
			sum[i] = 0.0;
		}
		for (int i = 0; i < N; i++) {
			for (int j = 0; j < N; j++) {
				sum[j] += b[i][j] * col[i];
			}
		}
	}
	QueryPerformanceCounter(&t2);
	cout << "TimeConsume:" << ((t2.QuadPart - t1.QuadPart) * 1.0 / tc.QuadPart);
	return 0;
}